Markov bases of three-way tables are arbitrarily complicated
نویسندگان
چکیده
We show the following two universality statements on the entry-ranges and Markov bases of spaces of 3-way contingency tables with fixed 2-margins: (1) For any finite set D of nonnegative integers, there are r, c, and 2-margins for (r, c, 3)-tables such that the set of values occurring in a fixed entry in all possible tables with these margins is D. (2) For any integer n-vector d, there are r, c such that any Markov basis for (r, c, 3)-tables with fixed 2-margins must contain an element whose restriction to some n entries is d. In particular, the degree and support of elements in the minimal Markov bases when r and c vary can be arbitrarily large, in striking contrast with 1-margined tables in any dimension and any format and with 2-margined (r, c, h)-tables with both c, h fixed. These results have implications to confidential statistical data disclosure control. Specifically, they demonstrate that the entry-range of 2-margined 3-tables can contain arbitrary gaps, suggesting that even if the smallest and largest possible values of an entry are far apart, the disclosure of such margins may be insecure. Thus, the behavior of sensitive data under disclosure of aggregated data is far from what has been so far believed. Our results therefore call for the reexamination of aggregation and disclosure practices and for further research on the issues exposed herein. Preprint submitted to The Journal of Symbolic Computation Our constructions also provides a powerful automatic tool in constructing concrete examples, such as the possibly smallest 2-margins for (6, 4, 3)-tables with entryrange containing a gap.
منابع مشابه
Markov bases for typical block effect models of two-way contingency tables
Markov basis for statistical model of contingency tables gives a useful tool for performing the conditional test of the model via Markov chain Monte Carlo method. In this paper we derive explicit forms of Markov bases for change point models and block diagonal effect models, which are typical block-wise effect models of two-way contingency tables, and perform conditional tests with some real da...
متن کاملMarkov bases and subbases for bounded contingency tables
In this paper we study the computation of Markov bases for contingency tables whose cell entries have an upper bound. In general a Markov basis for unbounded contingency table under a certain model differs from a Markov basis for bounded tables. Rapallo and Rogantin (2007) applied Lawrence lifting to compute a Markov basis for contingency tables whose cell entries are bounded. However, in the p...
متن کاملA sample space of k-way tables given conditionals and their relations to marginals: Implications for cell bounds and Markov bases
Abstract: The structure of the space of possible contingency table realizations under some constraints such as marginal totals has been studied in the algebraic statistics literature. The properties of the space of tables, i.e., fibers, are important for conducting exact conditional inferences, calculating cell bounds, imputing missing cell values, and assessing the risk of disclosure of sensit...
متن کاملMinimal basis for connected Markov chain over 3× 3×K contingency tables with fixed two-dimensional marginals
We consider connected Markov chain for sampling 3 × 3 × K contingency tables having fixed two-dimensional marginal totals. Such sampling arises in performing various tests of the hypothesis of no three-factor interactions. Markov chain algorithm is a valuable tool for evaluating p values, especially for sparse data sets where large-sample theory does not work well. For constructing a connected ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 41 شماره
صفحات -
تاریخ انتشار 2006